On the asymptotic number of inequivalent binary self-dual codes
نویسندگان
چکیده
منابع مشابه
Asymptotic Bound on Binary Self-Orthogonal Codes
We present two constructions for binary selforthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R = 1/2, by our constructive lower bound, the relative minimum distance δ ≈ 0.0595 (for GV bound, δ ≈ 0.110). Moreover, we have proved that the binary selforthogonal codes asymptotically achieve the...
متن کاملThe asymptotic number of binary codes and binary matroids
The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
متن کاملOn binary self-dual extremal codes
There is a large gap between Zhang’s theoretical bound for the length n of a binary extremal self-dual doublyeven code and what we can construct. The largest n is 136. In order to find examples for larger n a non-trivial automorphism group might be helpful. In the list of known examples extended quadratic residue codes and quadratic double circulant codes have large automorphism groups. But in ...
متن کاملOn the Enumeration of Binary Self-Dual Codes
We give a classification of singly-even self-dual binary codes of length 32, by enumerating all neighbours of the known 85 doublyeven self-dual binary codes of length 32. There are 3, 210 singly-even self-dual binary codes of length 32 up to equivalence. This agrees in number with the enumeration by Bilous and van Rees, who enumerated these codes by a different method.
متن کاملOn the performance of binary extremal self-dual codes
The decoding error probability of a code C measures the quality of performance when C is used for error correction in data transmission. In this note we compare different types of codes with regard to the decoding error probability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2007
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2006.07.003